The Linear Time Hierarchy Theorems for Abstract State Machines and RAMs
نویسندگان
چکیده
We prove the Linear Time Hierarchy Theorems for random access machines and Gurevich abstract state machines. One long-term goal of this line or research is to prove lower bounds for natural linear time problems.
منابع مشابه
Evolving Algebras and Linear Time Hierarchy
A program Q simulates a program P in lock-step under a given representation of states of P as states of Q if there is a constant c such that if P transforms a state A to a state A in time then Q transforms (A) into (A) in time c . (Cf. the related notions of real-time computation and simulation [R,S].) The constant c is the lag factor of the simulation. We speak about time rather than the numbe...
متن کاملOptimal Finite-time Control of Positive Linear Discrete-time Systems
This paper considers solving optimization problem for linear discrete time systems such that closed-loop discrete-time system is positive (i.e., all of its state variables have non-negative values) and also finite-time stable. For this purpose, by considering a quadratic cost function, an optimal controller is designed such that in addition to minimizing the cost function, the positivity proper...
متن کاملThe Interface Between Complexity and Programming Languages
State Machines and Linear Time Hierarchies Yuri Gurevich University of Michigan (This is joint work with Andreas Blass.) We generalize Neil Jones’ Linear Time Hierarchy Theorem to Random Access Machines and (which is harder) to Abstract State Machines. Normalization by Evaluation Helmut Schwichtenberg Universität München (This is joint work with Ulrick Berger and Matthias Eberl.) We extend norm...
متن کاملSpace Hierarchy Results for Randomized Models
We prove space hierarchy and separation results for randomized and other semantic models of computation with advice. Previous works on hierarchy and separation theorems for such models focused on time as the resource. We obtain tighter results with space as the resource. Our main theorems are the following. Let s(n) be any spaceconstructible function that is Ω(log n) and such that s(an) = O(s(n...
متن کاملLower bounds and complete problems in nondeterministic linear time and sublinear space complexity classes
Proving lower bounds remains the most difficult of tasks in computational complexity theory. In this paper, we show that whereas most natural NP-complete problems belong to NLIN (linear time on nondeterministic RAMs), some of them, typically the planar versions of many NP-complete problems are recognized by nondeterministic RAMs in linear time and sublinear space. The main results of this paper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. UCS
دوره 3 شماره
صفحات -
تاریخ انتشار 1997